10. Randomized Algorithms: color coding and monotone local search - COMP6741: Parameterized and Exact Computation

نویسنده

  • Edward Lee
چکیده

Monte Carlo algorithms Definition 1. • A Monte Carlo algorithm is an algorithm whose output is incorrect with probability at most p. • A one sided error means that an algorithm’s input is incorrect only on true outputs, or false outputs but not both. • A false negative Monte Carlo algorithm is always correct when it returns false. Suppose we have an algorithm A for a decision problem which: • If no-instance: returns “no”. • If yes-instance: returns “yes” with probability p. Algorithm A is a one-sided Monte Carlo algorithm with false negatives. Problem Suppose A is a one-sided Monte Carlo algorithm with false negatives, that with probability p returns “yes” when the input is a yes-instance. How can we use A and design an a new algorithm which ensures a new success probability of a constant C? Let t = − ln(1−C) p and repeat t times. Failure probability is (1− p) ≤ (e−p)t = 1 ept = 1− C via the inequality 1− x ≤ e−x.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

8. Parameterized intractability: the W-hierarchy - COMP6741: Parameterized and Exact Computation

1 Reminder: Polynomial Time Reductions and NP-completeness Polynomial-time reduction Definition 1. A polynomial-time reduction from a decision problem Π1 to a decision problem Π2 is a polynomialtime algorithm, which, for any instance of Π1 produces an equivalent instance of Π2. If there exists a polynomial-time reduction from Π1 to Π2, we say that Π1 is polynomial-time reducible to Π2 and write...

متن کامل

Mixing Color Coding-Related Techniques

In the past two decades, several breakthrough techniques, known as “color coding-related techniques”, lead to the design of extremely fast parameterized algorithms. In this paper, we introduce a family of strategies, that we call “mixing strategies”, for applying these techniques, developing even faster, closer to optimal, parameterized algorithms. Our strategies combine the following novel ide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017